Multicoloured Hamilton cycles and perfect matchings in pseudo-random graphs
نویسندگان
چکیده
Given 0 < p < 1, we prove that a pseudo-random graph G with edge density p and sufficiently large order has the following property: Consider any red/blue-colouring of the edges of G and let r denote the proportion of edges which have colour red. Then there is a Hamilton cycle C so that the proportion of red edges of C is close to r. The analogue also holds for perfect matchings instead of Hamilton cycles. We also prove a bipartite version which is used elsewhere to give a minimum-degree condition for the existence of a Hamilton cycle in a 3-uniform hypergraph.
منابع مشابه
Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs
Select four perfect matchings of 2n vertices, independently at random. We find the asymptotic probability that each of the first and second matchings forms a Hamilton cycle with each of the third and fourth. This is generalised to embrace any fixed number of perfect matchings, where a prescribed set of pairs of matchings must each produce Hamilton cycles (with suitable restrictions on the presc...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملPerfect Matchings, Tilings and Hamilton Cycles in Hypergraphs
This thesis contains problems in finding spanning subgraphs in graphs, such as, perfect matchings, tilings and Hamilton cycles. First, we consider the tiling problems in graphs, which are natural generalizations of the matching problems. We give new proofs of the multipartite Hajnal-Szemerédi Theorem for the tripartite and quadripartite cases. Second, we consider Hamilton cycles in hypergraphs....
متن کاملMulticoloured Hamilton cycles in random graphs; an anti-Ramsey threshold
Let the edges of a graph G be coloured so that no colour is used more than k times. We refer to this as a k-bounded colouring. We say that a subset of the edges of G is multicoloured if each edge is of a different colour. We say that the colouring is H-good, if a multicoloured Hamilton cycle exists i.e., one with a multicoloured edge-set. Let ARk = {G : every k-bounded colouring of G is H-good}...
متن کاملPacking hamilton cycles in random and pseudo-random hypergraphs
We say that a k-uniform hypergraph C is a Hamilton cycle of type `, for some 1 ≤ ` ≤ k, if there exists a cyclic ordering of the vertices of C such that every edge consists of k consecutive vertices and for every pair of consecutive edges Ei−1, Ei in C (in the natural ordering of the edges) we have |Ei−1 \ Ei| = `. We prove that for k/2 < ` ≤ k, with high probability almost all edges of the ran...
متن کامل